Wheel-free planar graphs
نویسندگان
چکیده
A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three neighbors in C. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable. AMS classification: 05C75 ∗Partially supported by Agence Nationale de la Recherche under reference anr 10 jcjc 0204 01. †Supported by NSF grants DMS-1001091 and IIS-1117631. ‡Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-1265563. §partially supported by ANR project Stint under reference ANR-13-BS02-0007. Also Labex Milyon, INRIA, Université de Lyon, Université Lyon 1.
منابع مشابه
A non-planar version of Tutte's wheels theorem
Thtte's Wheels Theorem states that a minimally 3-connected non-wheel graph G with at least four vertices contains at least one edge e such that the contraction of e from G produces a graph which is both 3-connected and simple. The edge e is said to be non-essential. We show that a minimally 3-connected graph which is non-planar contains at least six non-essential edges. The wheel graphs are the...
متن کاملUntangling planar graphs from a specified vertex position - Hard cases
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding π of the vertex set of G into the plane. Let fix(G, π) be the maximum integer k such that there exists a crossing-free redrawing π of G which keeps k vertices fixed, i.e., there exist k vertices v1,...
متن کاملOn the chromatic number of wheel-free graphs with no large bipartite graphs
A wheel is an induced cycle C plus a vertex connected to at least three vertices of C. Trotignon [14] asked if the class of wheel-free graphs is χ-bounded, i.e. if the chromatic number of every graph with no induced copy of a wheel is bounded by a function of its maximal clique. In this paper, we prove a weaker statement: for every `, the class of graphs with no induced wheel and no induced K`,...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملSimultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is a drawing of the two graphs where each graph is drawn planar, no two edges overlap, and edges of one graph can cross edges of the other graph only at right angles. In the geometric version of the problem, vertices are drawn as points and edges as straight-line segments. It is known, however, that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 49 شماره
صفحات -
تاریخ انتشار 2015